QoS guarantee using probabilistic deadlines
نویسندگان
چکیده
This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task instance will complete its execution before its absolute deadline (hard guarantee), our approach permits to estimate the probability that it will happen. Such a statistical guarantee is performed based on interarrival and execution times probability distributions, rather than their worst case values. The advantage of a probabilistic approach is a more efficient usage of system resources, allowing to give a certain level of deadline guarantee to task sets that the classical schedulability analysis would reject.
منابع مشابه
Integrated Dynamic Scheduling of Hard and QoS Degradable Real-Time Tasks in Multiprocessor Systems
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. For tasks with hard deadlines, a deadline miss can be catastrophic while for QoS degradable tasks (soft realtime tasks) timely approximate results of poorer quality or occasional deadline misses are acceptable. Imprecise computation and (m,k)-firm guarantee are two workload ...
متن کاملFP/FIFO Scheduling: Coexistence of Deterministic and Probabilistic QoS Guarantees
In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-to-end response time (or jitter). We propose a solution allowing the coexistence of two types of quantitative QoS guarantees, deterministic and probabilistic, while providing high resource utilization. Our solution combines the advantages of both the deterministic and the probabilistic a...
متن کاملTask Assignment on Parallel QoS Systems
Request Processing Systems should exhibit predictable behavior by guaranteeing Quality-of-Service parameters. One of the important requirements of predictability is that requests should have maximum acceptable response time thresholds, denoted as deadlines in this paper. In order to provide QoS, the system should try to guarantee these deadlines. This way, it is desirable to use a load-balancin...
متن کاملAutonomous Runtime QoS Control for Composite Services in SOA
Negotiating multiple SLAs in itself is not sufficient to guarantee end-to-end QoS levels as SLAs in practice often give probabilistic QoS guarantees and SLA violations can still occur. Moreover probabilistic QoS guarantees do not necessarily capture time-dependent behavior, (e.g., short term service degradations). Therefore, the negotiation of SLAs needs to be supplemented with run-time QoS-con...
متن کاملA Generalized Guarantee Model for Servicing SporadicTasks with Firm
A new guarantee model for accepting dynamically arriving sporadic tasks is presented in this paper. In this model, sporadic tasks have two costs associated with them. The costs represent the overheads a system will incur if the task is rejected and/or misses its deadline. The basic idea of the proposed model is to accept a task only if accepting the task lowers the expected cost due missed spor...
متن کامل